Quantum Bit Commitment can be Unconditionally Secure
نویسنده
چکیده
It is generally believed that unconditionally secure quantum bit commitment is ruled out in principle by a “no-go theorem”. We point out that the theorem only establishes the existence of a cheating unitary operator in any scheme of quantum bit commitment, however there is no proof that the unitary operator is always known to the cheating party, hence it does not necessarily follow that quantum bit commitment is insecure. In this work, we propose a scheme where the cheating party cannot construct the required unitary operator because it depends on the other party’s unknown random choices; consequently the scheme is not breakable even with the help of a quantum computer. PACS numbers: 03.67.-a, 89.70.+c Typeset using REVTEX E-mail address: [email protected]
منابع مشابه
Unconditionally Secure Quantum Bit Commitment is Simply Possible
Mayers, Lo and Chau proved unconditionally secure quantum bit commitment is impossible. It is shown that their proof is valid only for a particular model of quantum bit commitment encoding, in general it does not hold good. A different model of unconditionally secure quantum bit commitment both entanglement and disentanglement-based is presented. Even cheating can be legally proved with some le...
متن کاملAre entanglement and quantum computer necessary for quantum bit commitment ?
. It was claimed that unconditionally secure quantum bit commitment is impossible due to quantum-computer-assisted-entanglement-attack Recently we have shown that quantum computer-assisted-entanglement-attack can be totally foiled by entanglement and quantum computer. Here we present an alternative un-entanglement based quantum bit commitment scheme. Although the scheme is unconditionally secur...
متن کاملUnconditionally Secure Quantum Bit Commitment Is Possible
Bit commitment involves the submission of evidence from one party to another so that the evidence can be used to confirm a later revealed bit value by the first party, while the second party cannot determine the bit value from the evidence alone. An unconditionally secure bit commitment protocol utilizing quantum states is presented. The generality of previous proofs on the impossibility of qua...
متن کاملM ar 2 00 4 An Unconditionally Secure Quantum Bit Commitment Scheme
An unconditionally secure quantum bit commitment is proposed in this paper. we show that this scheme is statistically binding and perfectly concealing. The security of the protocol is based on the existence of quantum one-way functions by fundamental principles of quantum physics. As a conclusion of this paper, statistically binding and perfectly concealing quantum bit commitment schemes can be...
متن کاملUnconditionally Secure Quantum Bit Commitment
Lo and Chau, and independently Mayers, have shown that all quantum bit commitment schemes proposed to date are insecure: one or both participants can cheat if they have a quantum computer. They claim also to have demonstrated that unconditionally secure quantum bit commitment is impossible. However, their no-go arguments rely on models of quantum cryptographic protocols which are insufficiently...
متن کاملua nt - p h / 00 06 10 9 v 7 18 O ct 2 00 0 UNCONDITIONALLY SECURE QUANTUM BIT COMMITMENT IS POSSIBLE Horace
Bit commitment involves the submission of evidence from one party to another so that the evidence can be used to confirm a later revealed bit value by the first party, while the second party cannot determine the bit value from the evidence alone. It is widely believed that unconditionally secure quantum bit commitment is impossible due to quantum entanglement cheating, which is codified in a ge...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001